Approximate Model Counter

UniGen approximately uniform sampler

A Free World Class High Performance SAT Solver

CMSGen, a fast weighted uniform-like sampler

Efficient and customizable CNF parser for SAT solving.

An ROBDD & CDCL based SAT solver

Random KCNF formulas generator and WalkSAT solver implementation for AI class at UNIFI

Parses conjunctive normal form hyperblock notation to parallel coordinate graph visualizations. Hyperblocks are an interpretable way to build machine learning models.

In this repository I show how to perform a parallel BFS on graph constructed from CNF formulas.

Conversor to WPM(1,3), dimacs format

Implementation of n x n SAT Sudoku solver using minisat

This program checks if an input CNF is satisfiable or not to check logical entailment.

Boolean formula to CNF conversion, DPLL and CDCL SAT solving algorithms

✏ SAT approach for 8-queens problem

Knowledgebase agent designed to solve a Minesweeper board

Modeling and solving Discovery of Drug Agencies(an NP class problem) as a SAT Problem. See the problem statement for more details.

Export conclusions with resolution (resolution) / conclusions with forward chaining for (definite) Horn clauses of propositional logic

Convert logical problem to CNF

A GNU Prolog programme to convert boolean expressions into CNF.

Given a relationship matrix among guests, output the seating arrangement. The program converts the relationship matrix into CNF clauses and finds a solution (SAT) using DPLL algorithm.